• 专利附录
  • 专利说明
  • 权利要求
  • 类似技术
  • 同族专利
  • 引用文献
  • 法律状态
  • 优先权
    • 专利摘要:
    A method for reconfiguring a wireless sensor array in which certain nodes, called coordinating anchors, emit beacon signals, and other so-called subordinate anchors receive them only for synchronization purposes. The entire network is synchronized step by step by means of radio links from a primary anchor, the different nodes being moreover configured via an auxiliary channel from a central server. When a node loses its synchronization, one or more subordinate anchors can be transformed into coordinating anchors by the central server in order to restore the synchronization of the node. Similarly, when an electronic tag moves in the network, subordinate anchors can be dynamically transformed into coordinating anchors to ensure synchronization of the tag.
    公开号:FR3047383A1
    申请号:FR1650725
    申请日:2016-01-29
    公开日:2017-08-04
    发明作者:Ludovic Tancerel；Rejane Dalce
    申请人:Maple High Tech；
    IPC主号:
    专利说明:

    RECONFIGURABLE SENSOR ARRAY DESCRIPTION
    TECHNICAL FIELD The object of the present invention relates to the field of reconfigurable sensor networks. The present invention is particularly applicable to the management of tag communications in such a network.
    STATE OF THE PRIOR ART
    Wireless Sensor Networks (WSNs) have recently been the subject of much research.
    It is recalled that a WSN network is an ad hoc network comprising a large number of nodes that are generally sensors capable of collecting and transmitting measurements autonomously. The position of the nodes in such a network is not necessarily determined. When a node of the network knows its position or can determine it, it is called anchor node or simply anchor.
    One of the most common problems encountered in a wireless sensor network is the failure of a node, hardware or software. The occurrence of a node failure generates a network coverage hole.
    Various solutions have been proposed in the state of the art to remedy the appearance of a cover hole. A first strategy, called static maintenance, consists in replacing a first subset of nodes providing coverage with a second subset of nodes of the network, previously in standby mode, realizing the same coverage and therefore redundant with the first. A second strategy, called dynamic maintenance, consists in reconfiguring the network dynamically, for example by adaptively completing the nodes of the first subset whose battery level is still sufficient with nodes of the second subset, for to cover a number of targets. This latter technique has been described in the article by D. Tchuani-Tchakonte et al. entitled "Adaptive Healing Procedure for Wireless Sensor Networks" published in Proc, of On-Line Testing Symposium (OLTS), pp. 59-64, 2015.
    However, the network reconfiguration policy described in this article is only applicable when the network nodes are fixed. The emergence of mobile WSN networks (that is, whose nodes are mobile) and hybrid networks (that is, some fixed nodes and other mobiles) has created new strategies. to remedy the problem of cover holes. These strategies generally have the common point of identifying and locating the failing node, selecting the replacement nodes, and moving the replacement nodes to fill the gap. An example of such a reconfiguration strategy has been described in the article by G. Wang et al. entitled "Sensor relocation in mobile sensor networks" published in Proc, of Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM), 2015.
    The reconfiguration strategies of mobile WSN networks (even hybrid) assume that the different nodes have the capacity to know or calculate their position (that is to say are anchors in the sense defined above) and that some of them between them, moreover, they have the ability to move and orient themselves autonomously. For this purpose, the anchors may be equipped with a GPS receiver or a triangulation system with respect to fixed anchors. Such a solution is complex and expensive, or even simply unrealizable in certain types of environment. In addition, when the new position of an anchor is erroneous, measurements made by or with this anchor will also be erroneous. The errors can thus propagate gradually until reaching a significant part of the WSN network.
    The problem underlying the invention is therefore to propose a method for reconfiguring a WSN network that does not have the aforementioned drawbacks, in particular that does not require redundancy in the network nor does it require physically moving the anchors. network to fill a gap.
    STATEMENT OF THE INVENTION
    The present invention is defined by a method for reconfiguring a wireless sensor network organized according to a tree architecture, said network comprising nodes of a first type, called coordinating anchors, capable of receiving and transmitting a beacon signal. and nodes of a second type, called subordinate anchors, capable of receiving a beacon signal to synchronize with the network, the nodes being, moreover, connected by an auxiliary channel to a central server, in which, when a node loses its synchronization with the network, it warns the central server and it derives, from the topology of the network, the coordinating anchor at the origin of the loss of synchronization and the subtree of the network reached by the loss of synchronization, the central server selects a pair of nodes consisting of a first node belonging to said subtree and a second node belonging to the rest of the network (S ST), and if the sec ond node is a subordinate anchor, transmits a transformation order to transform it into a coordinating anchor, the first node synchronizing with the network by means of the beacon signal transmitted by the second node thus transformed.
    When the second node receives the transformation order from the central server, it sends an acknowledgment message and transmits its own beacon signal.
    When the first node receives the beacon signal from the second node, it sends a message to the central server indicating that it is synchronized.
    If the first node is a subordinate anchor and the subtree is not reduced to this first node, the central server sends it a transformation order to transform it into a coordinating anchor, at least a third node belonging to said subtree is synchronizing then by means of the beacon signal transmitted by the first node thus transformed.
    When the first node receives a transformation order from the central server, the central server starts transmitting its own beacon signal and sends it an acknowledgment message.
    Advantageously, the central server selects the pair of nodes on the basis of a minimum distance criterion separating these nodes and / or a link quality criterion between these nodes. The invention also relates to a method for reconfiguring a wireless sensor network organized according to a tree architecture, said network comprising nodes of a first type, called coordinating anchors, capable of receiving and transmitting a beacon signal and nodes of a second type, called subordinate anchors, capable of receiving a beacon signal to synchronize with the network, the nodes being further connected by an auxiliary channel to a central server, at least one electronic tag being mobile within of the network, said tag being able to synchronize with the network from a beacon signal transmitted by a coordinating anchor, wherein, when said tag has not received a beacon signal for a first predetermined time interval, it issues orphan status notifications until it receives a beacon signal again, and the subordinate anchors of the network receiving the orphan status notifications each transmits to the central server a report including an identifier of the tag, the MAC address of the subordinate anchor that has received the orphan status notification, and an indicator of the quality of the link between said tag and the subordinate anchor, the central server selecting a subordinate anchor among those having received orphan status notifications based on at least said link quality, the central server transmitting a transformation order to the subordinate anchor as well as selected to transform it into a coordinating anchor, said tag synchronizing with the network by means of the beacon signal transmitted by the coordinating anchor thus obtained.
    The report sent by a subordinate anchor may further include the number of orphan status notifications received from the tag during a second predetermined time interval.
    The central server advantageously performs the selection of the subordinate anchor on the basis of a link quality criterion between the subordinate anchor and the tag, and, if appropriate, a number of received orphan status notifications of the tag by the subordinate anchor during the second predetermined time interval.
    When the selected subordinate anchor receives a transformation order from the central server, the central server starts transmitting its own beacon signal and sends an acknowledgment message to the central server via the auxiliary channel.
    When said label receives the beacon signal of the coordinating anchor thus obtained, it transmits to the latter an association request by means of a unicast message.
    According to an exemplary embodiment, the sensor network complies with the IEEE 802.15.4 standard.
    The auxiliary channel may be a wired link or a Wi-Fi link.
    BRIEF DESCRIPTION OF THE DRAWINGS Other features and advantages of the invention will appear on reading a preferred embodiment of the invention, with reference to the appended figures among which:
    Fig. 1 schematically shows a WSN network that can be reconfigured by the reconfiguration method according to the invention;
    Fig. 2 schematically represents an example of temporal orgnaisation of the transmissions of beacons in the network;
    Figs. 3A and 3B illustrate first and second examples of loss of synchronization in the network of FIG. 1;
    Fig. 4 represents an example of exchange of messages in the network in the event of loss of synchronization of a tag;
    Fig. 5 schematically represents a flowchart of the method for reconfiguring a WSN network according to a first embodiment of the invention;
    Fig. 6 schematically represents a flow chart of the method for reconfiguring a WSN network according to a second embodiment of the invention.
    DETAILED PRESENTATION OF PARTICULAR EMBODIMENTS
    We will consider in the following a WSN network, and more particularly a network obeying the IEEE 802.15.4 communication protocol, such as a ZigBee ™ or 6L0WPAN ™ network. We will assume that the MAC layer operates in beacon mode, ie the network has a number of coordinating nodes transmitting at regular intervals a beacon, ie a beacon mode. signal allowing the surrounding nodes to synchronize. The physical layer of the network is preferably a UWB (Ultra Wide Band) communication system.
    Fig. 1 represents an exemplary WSN network that can be reconfigured by the reconfiguration method according to the present invention.
    The network is organized according to a tree topology (also called cluster-tree) around a noted master coordinator node still named in the primary coordinator anchor sequence. The set of nodes of the network is noted S.
    We will assume that the network in question includes two types of anchors. Anchors of the first type or co-ordinating anchors, denoted hereinafter Air i = 0, .., N -1 may emit beacons, while anchors of the second type or subordinate anchors, denoted hereinafter Bk, are intended to receive beacons of neighboring coordinating anchors without being able to emit them themselves. In normal operation, a subordinate anchor is connected to a coordinating anchor by a radio link, for example a UWB link.
    In addition, the coordinating anchors and the subordinate anchors are connected to a central server NS by another channel, called auxiliary channel, whose cutoff probability is lower than that of the radio link. According to a first variant embodiment, the auxiliary channel is a wired link, for example an Ethernet link. According to a second variant embodiment, when the radio link is a UWB link, the auxiliary channel is a Wi-Fi link. In the event of a loss of radio link with its coordinating anchor, a subordinate anchor may be isolated from the rest of the WSN network. (case of anchor B20) but it remains however connected to the NS server by its auxiliary channel.
    Without loss of generality, we will assume in the following that the auxiliary channel uses a wired link. For reasons of readability, the wired links between the anchors and the central server have not been shown in the figure.
    The NS server can be collocated with the primary coordinator anchor. The radio links serve in particular to synchronize the nodes with each other while the wired links with the server make it possible to configure the nodes.
    Tags (tags), for example RFID transponders, noted Tjr are also present in the area where the network is deployed and connected to the infrastructure by radio links. These tags receive beacons issued by coordinating anchors to synchronize with the network. On the other hand, when a tag does not receive any tags (for example, the Tw tag), it issues orphan notification notifications, which are then received by the subordinate anchors and the coordinating anchors at its scope.
    Fig. 2 schematically represents an example of temporal organization of the transmissions of beacons in the network.
    Beacons issued by an anchor coordinator are issued with a period Bl (Beacon Interval). The transmission between the anchors obeys a timing imposed by the primary coordinating anchor, constituted by the repetition of an interval with the period B1. Each interval between two successive tags comprises a superframe (superframe) of duration SD (superframe duration) followed a sleep period. At the beginning of the superframe, a sufficiently long time interval is provided, dedicated to the transmission of the beacons by the different coordinating anchors. This interval is known in the state of the art by the acronym BOP (Beacon Only Period). Thus, the beacons transmitted by the coordinating anchors of the network are all transmitted during the BOP interval.
    The different nodes synchronize when the network is powered up: the primary coordinating anchor, Ag, transmits a beacon signal that serves as a time reference to the rest of the network. The neighboring coordinating anchors receive the beacon signal via their respective radio links with Ag and in turn transmit their beacon signals.
    The process is repeated step by step until all coordinating anchors periodically emit their beacons. Similarly, the subordinate anchors and tags present in the area covered by the network receive beacon signals from the coordinating anchors that are within their reach.
    When a node of the network (coordinating or subordinate anchor) receives beacon signals from several coordinating anchors, the latter selects the coordinating anchor on the basis of a criterion of quality of connection, for example the coordinating anchor whose Beacon signal is of higher power or the highest signal-to-noise ratio link. This coordinating anchor is called reference anchor of the node in question.
    Each node that has just synchronized informs the central server and indicates the reference anchor on which it depends. Thus, the central server has a table providing, for each node, its type (coordinator or subordinate anchor), its synchronization status (synchronized node or not) and in the case where it is synchronized, its reference anchor .
    If, for any reason, a node no longer detects the beacon signal of its reference anchor, the latter warns the central server: its status changes from synchronized to unsynchronized. The loss of the beacon signal may be due to a failure affecting its reference anchor or a loss of connection with it. In any case, the node that lost synchronization goes into listen mode and periodically scans for a new beacon signal. This results in significant energy consumption.
    Similarly, when a tag no longer receives a beacon signal, the beacon gives orphan status notifications. The anchors (coordinators or subordinates) that receive these notifications relay the synchronization loss information to the central server by means of their wired links.
    Fig. 3A illustrates a first example of loss of synchronization in the network of FIG. 1.
    In the case illustrated, the anchor was synchronized thanks to the beacon signal transmitted by the anchor A1, in other words the anchor Aj was the reference anchor of the anchor The failure affecting the anchor ΑΊ induces a loss of synchronization anchor ^ (dashed link) which informs the central server. Since the anchor can no longer transmit a beacon, the subordinate anchors BU, BU and B13 themselves lose their synchronization vis-à-vis the rest of the network and notify the central server.
    The central server knows the tree structure of the various anchors from the primary coordinator anchor (the root of the tree) to the subordinate anchors (the leaves of the tree). It can determine from the link (s) lost (s) the reference anchor (here Αί) at the origin of the loss of synchronization and therefore the subtree ST of the network affected by the loss of synchronization.
    The central server knows the geographical position of the anchors (coordinators and subordinates) as well as the topology of the network. It searches in the set of nodes S ST, that is to say among the nodes of the set S not being part of the subset ST, an anchor able to serve as new reference anchor for the one of the nodes of the subtree ST.
    Different scenarios of reconfiguration are possible: • according to a first scenario, the anchor A * = , at the root of the subtree ST, is close to at least one other coordinator anchor of S ST having a synchronized status. Here is meant by a distance less than a predetermined threshold value or a link quality (expressed for example in signal to noise ratio) greater than a predetermined threshold level. When such an anchor S ST exists, the anchor A * receives a beacon signal thereof. If several coordinating anchors of S ST are close to A *, the closest to A * (eg the one corresponding to the best link quality) is selected. This first scenario does not require reconfiguration of the anchors insofar as a coordinating anchor replaces another coordinating anchor as reference anchor. In a second scenario, the anchor A * is close to at least one subordinate anchor of S ST having a synchronized status. In the case where several such subordinate anchors are close to A *, the closest to A * is selected. The central server transmits (by wire) to the subordinate anchor thus selected a transformation order which commands it to become anchor coordinator. This new anchor coordinator is noted A *. Anchor A * starts transmitting its own beacon signal. In addition, it confirms its type change by transmitting (wired) an acknowledgment message to the central server. Once the anchor A * has synchronized with the anchor As, it transmits on its side (by wire) to the central server its change of status. The central server updates its array by changing the anchor type A * and changing the anchor status A * (from unsynchronized to synchronized). • In a third scenario, a subordinate anchor of the ST subtree is close to an S ST coordinator anchor. In the case where several pairs of subordinate anchor and coordinating anchor verify this condition, we retain the subordinate ST anchor and the S ST co-ordinator anchor which are the closest (lowest distance or best quality). bond). The central server requests the subordinate anchor of ST thus selected to become co-ordinator anchor. This returns an acknowledgment message to the central server and transmits its own beacon signal when it is synchronized. • According to a fourth scenario (shown in Fig. 3A), a subordinate anchor of the subtree ST, is close to at least one subordinate anchor of S ST (having a synchronized status). In the case where several pairs of subordinate anchors belonging to the Cartesian product STx (S ST) satisfy the preceding condition, it will be possible to choose the pair of subordinate anchors nearest to the direction defined previously. Alternatively, we can retain the pair of subordinate anchors [Bi, Bj) of STx (S ST), such that Bj is located highest in the tree of S (that is to say, whose number of links separating it from the root A0 is the weakest). In any case, the central server asks the anchors Bi, BJ (here Bl3, Bu) to switch from type to become co-ordinating anchors. These each return an acknowledgment message when the switchover is made and the anchor Bi-Bl3 informs the server when it is synchronized (establishment of the mixed-line link).
    Note that the reconfiguration according to the third or fourth scenario may not allow to synchronize immediately all the nodes of the subtree ST. It must be iterated until all nodes in the subtree are synchronized. Similarly, several subtrees can be affected by a failure of a node. In this case, the different subtrees are processed sequentially.
    At the end of the reconfiguration process, the connectivity of the network is restored and all the nodes are synchronized.
    Fig. 3B illustrates a second example of loss of synchronization in the network of FIG. 1.
    In the illustrated case, the tag T3 has moved and lost its synchronization out of the coverage area of its An anchor An. Since the T3 tag no longer receives a beacon signal, it issues orphan status notifications. In general, a tag not receiving a predetermined number of successive tags deduces that it has lost its association with its reference anchor and transmits notifications of orphan status. These notifications are received by anchors (subordinates or coordinators) located near the path of the label, as it moves.
    If the tag enters the coverage area of a new coordinator anchor and therefore again receives a beacon signal, that tag immediately ceases transmitting orphan status notifications, synchronizes with the beacon signal, and transmits a beacon signal. association request (unicast message). The coordinating anchor responds to the association request with a confirmation message and informs the central server of this new association.
    On the other hand, if the orphan status notification is received by a subordinate anchor, the subordinate anchor reports wiredly to the central server. This report includes the address (MAC address for example) of the subordinate anchor that received the notification, the identifier of the tag that transmitted the notification, and an indicator of the link quality between the label and the anchor in question. Optionally, the report may include the number of orphan status notifications received by the anchor as well as the time stamps of the received notifications.
    The central server can determine, from time to time, from the reports of the anchors having received the orphan state notifications, the subordinate anchor best qualified to serve as anchor of reference to the label. For example, the central server may select the anchor whose link with the tag has the highest quality and / or the number of orphan state notifications the highest.
    The central server NS sends to the subordinate anchor thus selected (here Bu) a transformation order commanding him to change type, that is to say to become a coordinating anchor. The tag then receives the beacon signal from the new coordinating anchor. Upon receipt of the beacon signal, the tag stops transmitting orphan status notifications and issues an association request instead. The new coordinating anchor informs (wired) the central server of this new association (the new link is indicated in dashed line).
    Whether synchronizing an anchor or a tag, a subordinate anchor may need to be reconfigured as an anchor coordinator. The BOP interval is chosen long enough to be able to add a coordinating anchor without the risk of collision with already existing tags.
    Fig. 4 represents an example of exchange of messages in the network in the event of loss of synchronization of a tag.
    The wired messages are indicated by double arrows and those transmitted by radio channel are indicated by single line arrows.
    In 410, if the tag T has not received a predetermined number of consecutive tags, it begins to broadcast orphan status notifications.
    These notifications are received by anchors of the network, here subordinate anchors denoted Bn, Bk2, Bk3. Each of these anchors transmits in 420 a report to the central server, ie CRk1, CRk2, CRk3, each report including the MAC address of the subordinate anchor, the identifier of the tag T, a quality indicator of the link between the label and the subordinate anchor in question and, if applicable, the number of notifications received from the tag T as well as the time stamps of these notifications.
    The central server determines at 430 the subordinate anchor which is to be converted into a coordinating anchor on the basis of the link quality indicators and, if appropriate, the number of received notifications. In the case illustrated, the central server selects the anchor Bkl and transmits an order of transformation mBA commanding him to change type and become anchor coordinator.
    On receipt of the message mBA, the anchor Bk2 starts transmitting its beacon signal at 440 with the periodicity B1, the beacon being transmitted in the time interval BOP. The tag receives the beacon signal from the anchor Bk2 at 445 and synchronizes with the network through this signal.
    In addition, anchor Bk2 confirms to the central server that it has become 450 coordinator.
    Fig. 5 schematically represents a flow chart of a method for reconfiguring a WSN network according to a first embodiment of the invention.
    The network S comprises at least one coordinating anchor, it being agreed that this coordinating anchor is the primary coordinating anchor when the network comprises only one.
    Nodes in the network that are not coordinating anchors in the sense defined above are subordinate anchors.
    All the anchors of the network are connected to the central server by a wired connection.
    In the event of a loss of synchronization, any node no longer receiving a beacon signal from its reference anchor during a first predetermined time interval informs the central server at 510. The first time interval may be set equal to a multiple of the period Bl.
    In 520, the central server determines, from the logical topology of the network, the reference anchor at the origin of the loss of synchronization and the sub-tree ST of the network S affected by the synchronization loss in question. The root of this subtree is a node noted A *.
    In 530, the central server selects a pair of nodes consisting of a first node belonging to the subtree ST and a second node belonging to the rest of the network, S ST. This selection may be based on a distance criterion and / or a link quality criterion. In other words, the central server can choose the nearest pair of nodes and / or having the best link quality (for example through a signal-to-noise ratio indicator). If none of the node pairs are distant less than a predetermined distance or have a high quality link at a predetermined level, the central server completes the network reconfiguration process.
    In 540, if the second node is a subordinate anchor, the central server sends it a transformation order telling it to become a coordinating anchor. The latter then immediately emits its own beacon signal and sends an acknowledgment message to the central server in 550. When the second node is a coordinating anchor, no reconfiguration of this anchor is necessary.
    In 560, when the first node receives the beacon signal from the second node, the first node sends the central server a message indicating that it is well synchronized.
    In 570, if the first node is a subordinate anchor and the subtree ST is not reduced to the singleton {A *}, the central server transmits to the first node an order of transformation into a coordinating anchor so that it can synchronize at least a portion of the nodes of the subtree ST.
    When the first node receives a transformation order from the central server, the first node begins transmitting its own beacon signal and sends an acknowledgment message to the central server at 580.
    The process described in steps 530 to 580 may be iterated until all the nodes of the subtree are synchronized.
    Fig. 6 schematically represents a flow chart of the method for reconfiguring a WSN network according to a second embodiment of the invention.
    This embodiment relates to a reconfiguration of the network S when a tag T has lost its synchronization with the network, that is to say has not received a beacon signal during a first predetermined time interval. This first time interval may be set equal to a multiple of the period B1. At step 610, the tag T broadcasts orphan status notifications.
    If the tag T receives a beacon signal again, it re-synchronizes with the network, stops broadcasting orphan status notifications, and instead sends an association request with the coordinating anchor that has sent the signal. of beacon. This scenario does not require reconfiguration of network anchors (simple hand-over process). In step 620, an orphan state notification is received by one or more subordinate anchors of the network. In step 630, each of the anchors Bk1,..., Bkn transmits a report to the central server comprising the identifier of the tag, the MAC address of the subordinate anchor that received the notification, and the quality indicator of the link between the tag and the subordinate anchor in question. As previously indicated, the report may further comprise the number of received notifications (for example in a second predetermined time interval, multiple of B1) and the time stamps of these notifications. In step 640, the central server determines from the received reports of Β ^,.,., Β ^, the subordinate anchor Bs which will serve as a reference to the label 7 The choice can be made according to the quality of the link and, if applicable, the number of notifications received during the second time interval. In step 650, the central server transmits to the selected anchor Bs a transformation command commanding it to become coordinating anchor. In step 660, the Bs anchor transmits its own beacon signal and transmits an acknowledgment message to the central server. In step 670, the tag T receives the beacon signal from Bs, transmits to Bs an association request, in the form of a unicast message having as argument the MAC address of Bs, and stops broadcasting Orphan status notifications.
    Other subordinate anchors that no longer receive orphan status notifications stop reporting to the central server.
    Thus, the tag can move within the network, anchors subordinate to its scope dynamically moving to the state of coordinating anchors along its path to ensure the synchronization of the tag.
    权利要求:
    Claims (14)
    [1" id="c-fr-0001]
    1. Method for reconfiguring a wireless sensor network organized according to a tree architecture, said network comprising nodes of a first type, called coordinating anchors, capable of receiving and transmitting a beacon signal and nodes of a second type, called subordinate anchors, capable of receiving a beacon signal to synchronize with the network, the nodes being furthermore connected by an auxiliary channel to a central server, characterized in that, when a node loses its synchronization with the network, it warns the central server (510) and it derives (520), from the topology of the network, the coordinating anchor causing the loss of synchronization and the subtree (ST ) of the network reached by the loss of synchronization, the central server selects (530) a pair of nodes consisting of a first node belonging to said subtree and a second node belonging to the rest of the network (S ST), and if the second node not ud is a conditional anchor, transmits a command for transforming the coordinator in anchor, the first node is synchronizing with the network by means of the beacon signal transmitted by the second node so transformed.
    [2" id="c-fr-0002]
    Method for reconfiguring a wireless sensor network according to claim 1, characterized in that, when the second node receives the transformation command from the central server, it sends an acknowledgment message and transmits its own signal. of beacon.
    [3" id="c-fr-0003]
    Method for reconfiguring a wireless sensor network according to claim 1 or 2, characterized in that, when the first node receives the beacon signal from the second node, the latter sends a message to the central server indicating that it is synchronized.
    [4" id="c-fr-0004]
    Method for reconfiguring a wireless sensor network according to one of the preceding claims, characterized in that, if the first node is a subordinate anchor and the subtree is not reduced to this first node, the central server transmits a transformation order to transform it into a coordinating anchor, at least a third node belonging to said subtree then synchronizing by means of the beacon signal transmitted by the first node thus transformed.
    [5" id="c-fr-0005]
    Method for reconfiguring a wireless sensor network according to claim 4, characterized in that, when the first node receives a transformation command from the central server, the central server starts transmitting its own beacon signal and sends it an acknowledgment message.
    [6" id="c-fr-0006]
    Method for reconfiguring a wireless sensor network according to one of the preceding claims, characterized in that the central server selects the pair of nodes on the basis of a minimum distance criterion separating these nodes and / or d a link quality criterion between these nodes.
    [7" id="c-fr-0007]
    7. A method for reconfiguring a wireless sensor network organized according to a tree architecture, said network comprising nodes of a first type, called coordinating anchors, capable of receiving and transmitting a beacon signal and nodes. a second type, called subordinate anchors, capable of receiving a beacon signal to synchronize with the network, the nodes being furthermore connected by an auxiliary channel to a central server, at least one electronic tag being mobile within the network, said tag being able to synchronize with the network from a beacon signal transmitted by a coordinating anchor, characterized in that when said tag has not received a beacon signal during a first predetermined time interval, that tag broadcasts (610) orphan status notifications until it receives a beacon signal again, and the subordinate anchors of the receiving network orphan state reports (620) each transmit (630) to the central server a report including an identifier of the tag, the MAC address of the subordinate anchor that has received the orphan state notification, and a quality flag the link between said tag and the subordinate anchor, the central server selecting (640) a subordinate anchor among those having received the orphan status notifications on the basis of at least said link quality, the central server transmitting (650) a transformation order at the subordinate anchor thus selected to transform it into a coordinating anchor, said label synchronizing with the network by means of the beacon signal transmitted by the coordinating anchor thus obtained.
    [8" id="c-fr-0008]
    A method for reconfiguring a wireless sensor network according to claim 7, characterized in that the report sent by a subordinate anchor further comprises the number of orphan status notifications received from the tag during a second interval. predetermined time.
    [9" id="c-fr-0009]
    A method for reconfiguring a wireless sensor array according to claim 8, characterized in that the central server performs the selection of the subordinate anchor based on a link quality criterion between the subordinate anchor and the label, and, if applicable, a number of orphan status notifications received from the tag by the subordinate anchor during the second predetermined time interval.
    [10" id="c-fr-0010]
    10. A method of reconfiguring a wireless sensor network according to one of claims 7 to 9, characterized in that when the selected subordinate anchor receives a transformation order of the central server, it begins to issue its own beacon signal and sends (660) an acknowledgment message to the central server via the auxiliary channel.
    [11" id="c-fr-0011]
    11. Method for reconfiguring a wireless sensor network according to claim 10, characterized in that when said tag receives the beacon signal of the coordinating anchor thus obtained, it transmits to the latter a request for association with the means. a unicast message.
    [12" id="c-fr-0012]
    12. Method for reconfiguring a wireless sensor network according to one of the preceding claims, characterized in that the sensor array complies with the IEEE 802.15.4 standard.
    [13" id="c-fr-0013]
    13. Method for reconfiguring a wireless sensor network according to one of the preceding claims, characterized in that the auxiliary channel is a wire link.
    [0014]
    14 Method for reconfiguring a wireless sensor network according to one of claims 1 to 12, characterized in that the auxiliary channel is a Wi-Fi link.
    类似技术:
    公开号 | 公开日 | 专利标题
    EP3408967B1|2019-12-25|Reconfigurable network of sensors
    FR2893207A1|2007-05-11|TIME SYNCHRONIZATION AND GENERATION OF TAGS FOR MESH POINTS OPERATING IN A WIRELESS MESH NETWORK.
    EP2512201B1|2017-03-22|Transmitting/receiving station and method for forming a telecommunications network node
    FR2778303A1|1999-11-05|METHOD FOR TRANSFERRING A COMMUNICATION BETWEEN TWO RELAYS OF A CELL OF A CELLULAR DIGITAL RADIO-COMMUNICATION SYSTEM
    CA2568558A1|2005-12-08|Distributed synchronization method and system
    JP2017500772A|2017-01-05|Distributed algorithm for constructing and maintaining a hierarchical structure for device-to-device synchronization
    CA2811554A1|2012-11-01|Accelerated rejoining in low-power wireless networking for logistics and transportation applications
    EP2057807A1|2009-05-13|Method of routing data in a network comprising nodes organized in groups
    EP3253139B1|2019-02-27|Method for synchronising nodes in a wireless sensor network
    EP3607776B1|2021-04-21|Handover method for a tag in a wireless sensor network
    EP3331293B1|2019-09-18|Wireless network and process to localize a node in a network
    FR2967004A1|2012-05-04|NEIGHBORHOOD DISCOVERY SYSTEM AND METHOD FOR COMMUNICATING OBJECTS
    EP3603235B1|2021-03-10|Uwb locating method with auxiliary channel synchronisation
    EP3607800B1|2021-03-17|Wireless communication system comprising a physical channel for overall random access in time and space
    FR2939267A1|2010-06-04|Communication routing management method for home theatre type communication network, involves modifying routing of communication in network by selection of communication path along concentrated energy transmission mode
    EP3675564A1|2020-07-01|Base station of a mobile structure of a mobile radio communication system with regulated transmission power
    EP3804408A1|2021-04-14|Method of selecting a route in an ad hoc network
    FR2932627A1|2009-12-18|MOBILE TERMINAL OF A DECT-TYPE RADIOFREQUENCY WAVE COMMUNICATION SYSTEM AND METHOD FOR MANAGING ANTENNAS OF THIS TERMINAL
    CA3103089A1|2021-06-23|Method for extinction of a communication network
    EP1868407A1|2007-12-19|Device for selecting potential future home radio access networks for mobile terminals
    WO2015113869A1|2015-08-06|Relay method implemented in a radio communication network and terminal for implementing said method
    WO2014090412A1|2014-06-19|Method for obtaining hierarchical feedback from entity-location tracking in a theater of operations
    FR2983376A1|2013-05-31|Method for synchronizing digital European cordless telephone sub-networks of radio terminal network in military application, involves synchronizing sub-network having master node with low authority level based on sub-network synchronization
    FR2773932A1|1999-07-23|Time channel locating system for mobile radio stations within local area network
    WO2008035007A1|2008-03-27|Method for routing data packets in an ad-hoc large scale network comprising a plurality of geographical covering cells
    同族专利:
    公开号 | 公开日
    US11005711B2|2021-05-11|
    EP3408967A1|2018-12-05|
    EP3408967B1|2019-12-25|
    WO2017129478A1|2017-08-03|
    FR3047383B1|2018-03-02|
    US20190068441A1|2019-02-28|
    引用文献:
    公开号 | 申请日 | 公开日 | 申请人 | 专利标题
    US20100080118A1|2008-09-30|2010-04-01|Oki Electric Industry Co., Ltd.|Radio network system and control node switching method|
    US6754250B2|2000-12-15|2004-06-22|Telefonaktiebolaget Lm Ericsson |Networking in uncoordinated frequency hopping piconets|
    US8189494B2|2008-05-23|2012-05-29|Honeywell International Inc.|System and method for merging clusters of wireless nodes in a wireless network|
    KR101561117B1|2012-09-20|2015-10-16|주식회사 케이티|Method for active scanning in wireless local area network system|
    US10003642B2|2013-06-28|2018-06-19|Apple Inc.|Operating a cluster of peer-to-peer devices|
    EP3090498B1|2014-01-02|2018-12-26|TrackServer, Inc.|Method and apparatus for synchronizing clocks underwater using light and sound|
    US9961559B2|2015-12-14|2018-05-01|Nestwave Sas|Accurate short range positioning with wireless signals|FR3064442B1|2017-03-24|2019-05-03|Maple High Tech|UWB LOCATION METHOD WITH AUXILIARY CHANNEL SYNCHRONIZATION|
    EP3518155B1|2018-01-30|2021-05-26|Claitec Solutions, SL|Anti-collision system and method between objects|
    CN111132303B|2019-12-31|2021-11-05|苏州寻息电子科技有限公司|Wireless downlink communication method with low power consumption and high real-time performance|
    CN111542096B|2020-04-29|2022-02-11|沈阳理工大学|Routing method based on request domain expansion and hole processing|
    法律状态:
    2017-01-31| PLFP| Fee payment|Year of fee payment: 2 |
    2017-08-04| PLSC| Publication of the preliminary search report|Effective date: 20170804 |
    2018-01-31| PLFP| Fee payment|Year of fee payment: 3 |
    2020-04-30| PLFP| Fee payment|Year of fee payment: 5 |
    2021-01-28| PLFP| Fee payment|Year of fee payment: 6 |
    2022-01-31| PLFP| Fee payment|Year of fee payment: 7 |
    优先权:
    申请号 | 申请日 | 专利标题
    FR1650725|2016-01-29|
    FR1650725A|FR3047383B1|2016-01-29|2016-01-29|RECONFIGURABLE SENSOR ARRAY.|FR1650725A| FR3047383B1|2016-01-29|2016-01-29|RECONFIGURABLE SENSOR ARRAY.|
    US16/072,625| US11005711B2|2016-01-29|2017-01-20|Reconfigurable network of sensors|
    PCT/EP2017/051139| WO2017129478A1|2016-01-29|2017-01-20|Reconfigurable network of sensors|
    EP17700840.6A| EP3408967B1|2016-01-29|2017-01-20|Reconfigurable network of sensors|
    [返回顶部]